Verification by Augmented Finitary Abstraction
نویسندگان
چکیده
منابع مشابه
Verification by Augmented Finitary Abstraction
The paper deals with the proof method of veriication by nitary abstraction (vfa), which presents a feasible approach to the veriication of the temporal properties of (potentially innnite-state) reactive systems. The method consists of a two-step process by which, in a rst step, the system and its temporal speciica-tion are jointly abstracted into a nite-state system and a nite-state speciicatio...
متن کاملVerification by Abstraction
Verification seeks to prove or refute putative properties of a given program. Deductive verification is carried out by constructing a proof that the program satisfies its specification, whereas model checking uses state exploration to find computations where the property fails. Model checking is largely automatic but is effective only for programs defined over small state spaces. Abstraction se...
متن کاملVerifying Liveness by Augmented Abstraction
an in nite-state system into a nite-state one. This suggests an alternative approach to the temporal veri cation of in nite-state systems: abstract rst and model check later. In this work, we present a general framework for abstracting an arbitrary (in nite-state) reactive system D and its speci cation expressed as a linear temporal logic (ltl) formula , to a nite state problem that can be mode...
متن کاملParameterized Verification by Probabilistic Abstraction
The paper studies automatic verification of liveness properties with probability 1 over parameterized programs that include probabilistic transitions, and proposes two novel approaches to the problem. The first approach is based on a Planner that occasionally determines the outcome of a finite sequence of “random” choices, while the other random choices are performed non-deterministically. Usin...
متن کاملEnvironment Abstraction for Parameterized Verification
Many aspects of computer systems are naturally modeled as parameterized systems which renders their automatic verification difficult. In wellknown examples such as cache coherence protocols and mutual exclusion protocols, the unbounded parameter is the number of concurrent processes which run the same distributed algorithm. In this paper, we introduce environment abstraction as a tool for the v...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2000
ISSN: 0890-5401
DOI: 10.1006/inco.2000.3000